Determining angular frequency from video with a generalized fast Fourier transform THESIS
نویسندگان
چکیده
Suppose we are given a video of a rotating object and suppose we want to determine the rate of rotation solely from the video itself and its known frame rate. In this thesis, we present a new mathematical operator called the Geometric Sum Transform (GST) that can help one determine the angular frequency of the object in question. The GST is a generalization of the discrete Fourier transform (DFT) and as such, the two transforms have much in common. However, whereas the DFT is applied to a sequence of scalars, the GST can be applied to a sequence of vectors. Most importantly, we show that the GST, like the DFT, can (1) be used to estimate frequency and (2) can be computed surprisingly quickly. Indeed, we provide a Fast Geometric Sum Transform (FGST) algorithm that computes the GST in O(N logN) matrix-vector multiplications, where N is the number of images in the video sequence. This is a vast improvement over the O(N) such multiplications required for a direct computation of the GST. The remainder of this thesis is devoted to proving other properties of the GST and giving proof-of-concept numerical examples.
منابع مشابه
Pathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملSome New Results in Fast Hartley Transform Algorithms - M.S. Thesis
Finding the spectrum of a signal swiftly has been an ever-growing demand in Digital Signal Processing. In quest to meet this stipulation, Discrete Hartley Transform (DHT) is becoming as an encouraging substitute to the more popular discrete Fourier transform. Fast methods to compute the DHT are in existence and are named as fast Hartley transforms (FHTs). In this thesis, a new split-radix FHT a...
متن کاملThe sparse fourier transform : theory & practice
The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications...
متن کاملVideo Classification by Main Frequencies of Repeating Movements
This paper discusses an approach, which allows classifying videos by frequencies. Many videos contain repetitive activities like walking, swimming, or playing table tennis. These activities usually repeat with a certain frequency, which can be seen as a feature of cyclic motion. So determining this feature can help to classify videos with repeating movements properly. In this paper we explain h...
متن کاملTwo-dimensional fast generalized Fourier interpolation of seismic records
The fast generalized Fourier transform algorithm is extended to twodimensional data cases. The algorithm provides a fast and nonredundant alternative for the simultaneous time-frequency and spacewavenumber analysis of the data with time-space dependencies. The transform decomposes the data based on the local slope information, and therefore making it possible to extract weight function based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012